Uniform mixing time for random walk on lamplighter graphs
نویسندگان
چکیده
منابع مشابه
Uniform Mixing Time for Random Walk on Lamplighter Graphs
Suppose that G is a finite, connected graph and X is a lazy random walk on G. The lamplighter chain X associated with X is the random walk on the wreath product G = Z2 oG, the graph whose vertices consist of pairs (f, x) where f is a labeling of the vertices of G by elements of Z2 and x is a vertex in G. There is an edge between (f, x) and (g, y) in G if and only if x is adjacent to y in G and ...
متن کاملMixing times for Random Walks on Finite Lamplighter Groups
Given a finite graph G, a vertex of the lamplighter graph G♦ = Z2 o G consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive G we show that, up to constants, the relaxation time for simple random walk in G♦ is the maximal hitting time for simple random walk in G, while the mixing time in total variation on G♦ is the expected cover time on G. The mixing ti...
متن کاملMixing Time for a Random Walk on Rooted Trees
We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n2 steps are necessary and suffice for convergence to the stationary distribution.
متن کاملMixing and relaxation time for random walk on wreath product graphs∗
Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is a reversible ergodic Markov chain on H. The generalized lamplighter chain X associated with X and Z is the random walk on the wreath product H o G, the graph whose vertices consist of pairs (f, x) where f = (fv)v∈V (G) is a labeling of the vertices of G by elements of H and x is a vertex in G. In...
متن کاملreplacement and zig-zag products, cayley graphs and lamplighter random walk
we investigate two constructions - the replacement and the zig-zag product of graphs - describing several fascinating connections with combinatorics, via the notion of expander graph, group theory, via the notion of semidirect product and cayley graph, and with markov chains, via the lamplighter random walk. many examples are provided.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2014
ISSN: 0246-0203
DOI: 10.1214/13-aihp547